package binary_tree.searchtree;

/**
 * @Description: 测试二叉搜索树
 * @Author Stark
 * @Date 2022/3/12 19:38
 **/
public class BSTTest {
    public static void main(String[] args) {
        BST bst = new BST();
        int[] arr = new int[]{41,58,50,60,42,53,59,63};
        for(int i : arr){
            bst.add(i);
        }
        System.out.println(bst);
        System.out.println(bst.size());
        bst.remove(58);
        System.out.println(bst.size());

    }
}
